Interpretation and optimization of the k-means algorithm
نویسندگان
چکیده
منابع مشابه
Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملpersistent k-means: stable data clustering algorithm based on k-means algorithm
identifying clusters or clustering is an important aspect of data analysis. it is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. it is a main task of exploratory data mining, and a common technique for statistical data analysis this paper proposed an improved version of k-means algorithm, namely persistent k...
متن کاملOptimization Fusion Approach For Image Segmentation Using K-Means Algorithm
This paper presents a new ,simple and Efficient segmentation approach,based on a fusion procedure which aims at combining several segmentation maps associated to simpler partition models in order to finally get a more reliable, accurate and a non-overlapped image result. The main objective of the paper is to get a non-overlapping and a reliable output by using k-means and genetic algorithm. The...
متن کاملOptimization Fusion Approach for Image Segmentation Using K-Means Algorithm
This paper presents a new, simple and efficient segmentation approach, based on a fusion procedure which aims at combining several segmentation maps associated to simpler partition models in order to finally get a more reliable, accurate and a non-overlapped image result. The main objective of the paper is to get a non-overlapping and a reliable output by using k-means and genetic algorithm. Th...
متن کاملGenetic K-means algorithm
In this paper, we propose a novel hybrid genetic algorithm (GA) that finds a globally optimal partition of a given data into a specified number of clusters. GA's used earlier in clustering employ either an expensive crossover operator to generate valid child chromosomes from parent chromosomes or a costly fitness function or both. To circumvent these expensive operations, we hybridize GA with a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applications of Mathematics
سال: 2014
ISSN: 0862-7940,1572-9109
DOI: 10.1007/s10492-014-0063-5